Projective Plane and Möbius Band Obstructions

نویسنده

  • Bojan Mohar
چکیده

Let S be a compact surface with possibly non-empty boundary ∂S and let G be a graph. Let K be a subgraph of G embedded in S such that ∂S ⊆ K. An embedding extension of K to G is an embedding of G in S which coincides on K with the given embedding of K. Minimal obstructions for the existence of embedding extensions are classified in cases when S is the projective plane or the Möbius band (for several “canonical” choices of K). Linear time algorithms are presented that either find an embedding extension, or return a “nice” obstruction for the existence of extensions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets

We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known Möbius ladder inequalities. Our starting point is to observe that the natural derivation of the Möbius ladder inequalities as {0, 1 2 }-cuts produces triangulations of the Möbius band and of the corresponding (closed) surface, the projective plane. In that sense, Möbius ladder inequalities have ...

متن کامل

Geometric realization of a projective triangulation with one face removed

Let M be a map on a surface F . A geometric realization of M is an embedding of F 2 into a Euclidian 3space R with no self-intersection such that each face ofM is a flat polygon. In our talk, we shall prove that every triangulation G on the projective plane has a face f such that the triangulation of the Möbius band obtained from G by removing the interior of f has a geometric realization.

متن کامل

Counting polygon dissections in the projective plane

For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) on the number of triangulations of the Möbius band having n labelled points on its boundary. We also solve the problem when the polygon is dissected into subpolygons of arbit...

متن کامل

Finiteness Obstructions and Euler Characteristics of Categories

We introduce notions of finiteness obstruction, Euler characteristic, L2-Euler characteristic, and Möbius inversion for wide classes of categories. The finiteness obstruction of a category Γ of type (FP) is a class in the projective class group K0(RΓ); the Euler characteristic and L2-Euler characteristic are respectively its RΓ-rank and L2-rank. We also extend the second author’s K-theoretic Mö...

متن کامل

Obstructions For 2-Möbius Band Embedding Extension Problem

Let K = C ∪ e1 ∪ e2 be a subgraph of G, consisting of a cycle C and disjoint paths e1 and e2, connecting two interlacing pairs of vertices in C. Suppose that K is embedded in the Möbius band in such a way that C lies on its boundary. An algorithm is presented which in linear time extends the embedding of K to an embedding of G, if such an extension is possible, or finds a “nice” obstruction for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorica

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1997